Pii: S0925-7721(99)00036-x
نویسندگان
چکیده
A (not necessarily convex) object C in the plane is κ-curved for some constant 0 < κ < 1, if it has constant description complexity, and for each pointp on the boundary ofC, one can place a diskB ⊆ C of radius κ ·diam(C) whose boundary passes throughp. We prove that the combinatorial complexity of the boundary of the union of a set C of n κ-curved objects (e.g., fat ellipses or rounded heart-shaped objects) is O(λs(n) logn), for some constant s. 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
Polygons Cuttable by a Circular Saw
We introduce and characterize a new class of polygons that models wood, stone, glass, and ceramic shapes that can be cut with a table saw, lapidary trim saw, or other circular saw. In this model, a circular saw is a line segment (in projection) that can move freely in empty space, but can only cut straight into a portion of material. Once a region of material is separated from the rest, it can ...
متن کاملMore planar two-center algorithms
This paper considers the planar Euclidean two-center problem: given a planar n-point set S, nd two congruent circular disks of the smallest radius covering S. The main result is a deter-ministic algorithm with running time O(n log 2 n log 2 log n), improving the previous O(n log 9 n) bound of Sharir and almost matching the randomized O(n log 2 n) bound of Eppstein. If a point in the intersectio...
متن کاملConvex tours of bounded curvature
We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a form of a simple polygon with n vertices. We present an O(m + n) time algorithm finding the path, going around the obstacle, whose curvature is the smallest po...
متن کاملPii: S0925-7721(99)00016-4
Define a graph GT (n) with one node for each triangulation of a convex n-gon. Place an edge between each pair of nodes that differ by a single flip: two triangles forming a quadrilateral are exchanged for the other pair of triangles forming the same quadrilateral. In this paper we introduce a tree of all triangulations of polygons with any number of vertices which gives a unified framework in w...
متن کاملGamma-oscillations support optimal retrieval in associative memories of two-compartment neurons
Theoretical studies concerning iterative retrieval in conventional associative memories suggest that cortical gamma-oscillations may constitute sequences of fast associative processes each restricted to a single period. By providing a rhythmic threshold modulation suppressing cells that are uncorrelated with a stimulus, interneurons signi"cantly contribute to this process. This hypothesis is te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999